University Course Timetabling with Genetic Algorithm: A Case Study
نویسندگان
چکیده
منابع مشابه
University Course Timetabling with Genetic Algorithm: A Laboratory Excercises Case Study
This paper describes the application of a hybrid genetic algorithm to a real-world instance of the university course timetabling problem. We address the timetabling of laboratory exercises in a highly constrained environment, for which a formal definition is given. Solution representation technique appropriate to the problem is defined, along with associated genetic operators and a local search...
متن کاملSOLVING UNIVERSITY COURSE TIMETABLING PROBLEM USING GENETIC ALGORITHM Master Thesis
This is to certify that we have read this thesis and that we find it fully adequate in scope, quality and content, as a thesis for the degree of Master of Science. continously asking me " how is the thesis going? " , because she encouraged me to persevere without knowing it. Also I would like to thank to my best friend, my colleague, my dear husband Tarkan Aydın for his understanding, patience,...
متن کاملA memetic algorithm for University Course Timetabling
We present here a metaheuristic approach to the university course timetabling problem using a memetic algorithm with a very effective local search. The algorithm was tested on the International Timetabling Competition benchmark instances. Results are encouraging and show that evolutionary computation with the help of local search can compete with succesful algorithms on the problem.
متن کاملApplication of the Grouping Genetic Algorithm to University Course Timetabling
University Course Timetabling-Problems (UCTPs) involve the allocation of resources (such as rooms and timeslots) to all the events of a university, satisfying a set of hard-constraints and, as much as possible, some soft constraints. Here we work with a well-known version of the problem where there seems a strong case for considering these two goals as separate sub-problems. In particular we no...
متن کاملKnowledge-based genetic algorithm for university course timetabling problems
This paper discusses a new solution to university course timetabling problems. The problems that belong to the NP-hard class are very difficult to solve using conventional optimization techniques. Our solution methodology is based on a genetic algorithm which uses an installed knowledge base and an infection operation. The knowledge base here is a set of candidate partial solutions of the final...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Electrical Technology UMY
سال: 2017
ISSN: 2550-1186,2580-6823
DOI: 10.18196/jet.1213